The third smallest eigenvalue of the Laplacian matrix
نویسندگان
چکیده
Let G be a connected simple graph. The relationship between the third smallest eigenvalue of the Laplacian matrix and the graph structure is explored. For a tree the complete description of the eigenvector corresponding to this eigenvalue is given and some results about the multiplicity of this eigenvalue are given.
منابع مشابه
The smallest eigenvalue of the signless Laplacian
Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied. The present paper surveys the known results and presents some new ones about the smallest eigenvalue of the signless Laplacian.
متن کاملEla the Smallest Signless Laplacian Eigenvalue of Graphs under Perturbation
In this paper, we investigate how the smallest signless Laplacian eigenvalue of a graph behaves when the graph is perturbed by deleting a vertex, subdividing edges or moving edges.
متن کاملOn colored digraphs with exactly one nonsingular cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملEla on 3-colored Digraphs with Exactly One Nonsingular Cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کامل